On theta-palindromic richness

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Palindromic Richness

In this paper, we study combinatorial and structural properties of a new class of finite and infinite words that are ‘rich’ in palindromes in the utmost sense. A characteristic property of so-called rich words is that all complete returns to any palindromic factor are themselves palindromes. These words encompass the well-known episturmian words, originally introduced by the second author toget...

متن کامل

2 01 1 Generalized Thue - Morse words and palindromic richness

is valid for any infinite word u with language closed under reversal and for any n. Therefore, the fact that a word u is rich in palindromes expresses that u is saturated by palindromes up to the highest possible level. Arnoux-Rauzy words (among them Sturmian words) and words coding interval exchange transformation with the symmetric permutation belong to the most prominent examples of rich wor...

متن کامل

Languages invariant under more symmetries: Overlapping factors versus palindromic richness

Factor complexity C and palindromic complexity P of infinite words with language closed under reversal are known to be related by the inequality P(n) + P(n + 1) ≤ 2 + C(n + 1) − C(n) for any n ∈ N . Word for which the equality is attained for any n is usually called rich in palindromes. In this article we study words whose languages are invariant under a finite group G of symmetries. For such w...

متن کامل

On Highly Palindromic Words

We study some properties of palindromic (scattered) subwords of binary words. In view of the classical problem on subwords, we show that the set of palindromic subwords of a word characterizes the word up to reversal. Since each word trivially contains a palindromic subword of length at least half of its length—a power of the prevalent letter—we call a word that does not contain any palindromic...

متن کامل

On the Palindromic Reversal Process

When adding an integer and its reversal, one obtains another integer, which may also be added to its reversal, and so on. One iterates until it gives a palindromic result, that is to say a number reading the same backward as forward. 196 is known to be the rst number that apparently never produces a palindrome. We present new properties which provide a more accurate interpretation of the palind...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2011

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2010.12.011